A Novel Alternate Point-taking Strategy for Surrogate-Assisted Evolutionary Algorithm

نویسندگان

چکیده

The essence of surrogate model is a low-cost alternative, which mainly replaces the computationally heavy simulation process to reduce time cost consumed. In past two decades, this approximation based optimization method has made remarkable progress, and models are widely used in expensive analysis optimization. addition, with development technology, no longer simple substitute, but can drive new sample points join training on historical data, so as gradually approach global optimal solution problem. For problems, there many surrogates-assisted algorithm methods. However, selection great influence accuracy model. order obtain more accurate model, newly added should meet diversity criterion specified distance, at same time, corresponding strategies be adopted fully explore sparse regions, avoid falling into local phenomenon process. Therefore, an ensemble surrogates alternate point-taking strategy (APTS) proposed, hierarchical search framework designed, using different algorithms each stage. effectiveness APTS verified three benchmark examples dimensions compared several advanced results show that better robustness than other methods most test problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effectiveness of approximation strategy in surrogate-assisted fireworks algorithm

We investigate the effectiveness of approximation strategy in a surrogate-assisted fireworks algorithm, which obtains the elite from approximate fitness landscape to enhance its optimization performance. We study the effectiveness of approximation strategy from the aspects of approximation method, sampling data selection method and sampling size. We discuss and analyse the optimization performa...

متن کامل

A multi-fidelity surrogate-model-assisted evolutionary algorithm for computationally expensive optimization problems

Integrating data-driven surrogate models and simulation models of di erent accuracies (or delities) in a single algorithm to address computationally expensive global optimization problems has recently attracted considerable attention. However, handling discrepancies between simulation models with multiple delities in global optimization is a major challenge. To address it, the two major contrib...

متن کامل

Surrogate based Evolutionary Algorithm for Design Optimization

Optimization is often a critical issue for most system design problems. Evolutionary Algorithms are population-based, stochastic search techniques, widely used as efficient global optimizers. However, finding optimal solution to complex high dimensional, multimodal problems often require highly computationally expensive function evaluations and hence are practically prohibitive. The Dynamic App...

متن کامل

Surrogate-Assisted Partial Order-Based Evolutionary Optimisation

In this paper, we propose a novel approach (SAPEO) to support the survival selection process in multi-objective evolutionary algorithms with surrogate models it dynamically chooses individuals to evaluate exactly based on the model uncertainty and the distinctness of the population. We introduce variants that differ in terms of the risk they allow when doing survival selection. Here, the anytim...

متن کامل

An Adaptive Surrogate-Assisted Strategy for Multi-Objective Optimization

1. Abstract A sequential metamodel-based optimization method is proposed for multi-objective optimization problems. The algorithm, designated as Pareto Domain Reduction, is an adaptive sampling method and an extension of the classical Domain Reduction approach (also known as the Sequential Response Surface Method). In addition to standard benchmark examples, a Multidisciplinary Design Optimizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of advances in mathematics and computer science

سال: 2023

ISSN: ['2456-9968']

DOI: https://doi.org/10.9734/jamcs/2023/v38i71783